The average degree of an edge-chromatic critical graph
نویسندگان
چکیده
منابع مشابه
The average degree of an edge-chromatic critical graph
A graph G with maximum degree and edge chromatic number ′(G)> is edge-critical if ′(G− e)= for every edge e of G. New lower bounds are given for the average degree of an edge-critical graph, which improve on the best bounds previously known for most values of . Examples of edge-critical graphs are also given. In almost all cases, there remains a large gap between the best lower bound known and ...
متن کاملOn the maximum average degree and the oriented chromatic number of a graph
The oriented chromatic number o(H) of an oriented graph H is de ned as the minimum order of an oriented graph H ′ such that H has a homomorphism to H ′. The oriented chromatic number o(G) of an undirected graph G is then de ned as the maximum oriented chromatic number of its orientations. In this paper we study the links between o(G) and mad(G) de ned as the maximum average degree of the subgra...
متن کاملOn the maximum average degree and the incidence chromatic number of a graph
We prove that the incidence chromatic number of every 3-degenerated graph G is at most ∆(G)+ 4. It is known that the incidence chromatic number of every graph G with maximum average degree mad(G) < 3 is at most ∆(G)+3. We show that when ∆(G) ≥ 5, this bound may be decreased to ∆(G) + 2. Moreover, we show that for every graph G with mad(G) < 22/9 (resp. with mad(G) < 16/7 and ∆(G) ≥ 4), this bou...
متن کاملEdge Chromatic 5-Critical Graphs
In this paper, we study the structure of 5-critical graphs in terms of their size. In particular, we have obtained bounds for the number of major vertices in several classes of 5-critical graphs, that are stronger than the existing bounds.
متن کاملInjective Edge Chromatic Index of a Graph
Three edges e1, e2 and e3 in a graph G are consecutive if they form a path (in this order) or a cycle of length three. An injective edge coloring of a graph G = (V,E) is a coloring c of the edges of G such that if e1, e2 and e3 are consecutive edges in G, then c(e1) 6= c(e3). The injective edge coloring number χ ′ i(G) is the minimum number of colors permitted in such a coloring. In this paper,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.07.048